subsumption algorithm

См. также в других словарях:

• Register allocation — In compiler optimization, register allocation is the process of multiplexing a large number of target program variables onto a small number of CPU registers. The goal is to keep as many operands as possible in registers to maximise the execution… …   Wikipedia

• Artificial intelligence — AI redirects here. For other uses, see Ai. For other uses, see Artificial intelligence (disambiguation). TOPIO, a humanoid robot, played table tennis at Tokyo International Robot Exhibition (IREX) 2009.[1] Artificial intelligence ( …   Wikipedia

• Unit propagation — (UP) or the one literal rule (OLR) is a procedure of automated theorem proving that can simplify a set of (usually propositional) clauses.DefinitionThe procedure is based on unit clauses, i.e. clauses that are composed of a single literal. If a… …   Wikipedia

• Description logic — (DL) is a family of formal knowledge representation languages. It is more expressive than propositional logic but has more efficient decision problems than first order predicate logic. DL is used in artificial intelligence for formal reasoning on …   Wikipedia

• Automatic summarization — is the creation of a shortened version of a text by a computer program. The product of this procedure still contains the most important points of the original text. The phenomenon of information overload has meant that access to coherent and… …   Wikipedia

• Geosemantik — (im Englischen ist der Begriff geospatial semantics üblich) ist ein interdisziplinäres Forschungsfeld und befasst sich mit der Bedeutung von Geoinformation. Die Vision des virtuellen Globus Inhaltsverzeichnis …   Deutsch Wikipedia

• History of artificial intelligence — The history of artificial intelligence begins in antiquity with myths, stories and rumors of artificial beings endowed with intelligence and consciousness by master craftsmen. In the middle of the 20th century, a handful of scientists began to… …   Wikipedia

• Vampire theorem prover — Vampire is an automatic theorem prover for first order classical logic developed in the Computer Science Department of the University of Manchester by Prof. Andrei Voronkov previously together with Dr. Alexandre Riazanov. It has won the world cup …   Wikipedia

• Практическое применение раскраски графов — Эту статью следует викифицировать. Пожалуйста, оформите её согласно правилам оформления статей. Раскраска графов практически применяется (постановку задачи различиных раскрасок здесь обсуждаться не будет) дл …   Википедия

• Action selection — is a way of characterizing the most basic problem of intelligent systems: what to do next. In artificial intelligence and computational cognitive science, the action selection problem is typically associated with intelligent agents and animats… …   Wikipedia

• Syntactic methods — In software engineering, syntactic methods are techniques for developing correct software programs. The techniques attempt to detect, and thus prevent, certain kinds of defects (bugs) by examining the structure of the code being produced at its… …   Wikipedia